Parallel Natural Language Parsing: From Analysis to Speedup Parallel Natural Language Parsing: From Analysis to Speedup
نویسنده
چکیده
Preface The research presented in this thesis done in the context of the " Parallel Natural Language Interfaces " subproject of the IMPACT project. The IMPACT project was headed by the ING bank and founded by the organization for High Performance Computing and Networking (HPCN), itself partly funded by NWO. The goal of this subproject was to improve the performance of natural language interfaces. Considering the context of the research, there was a strong focus on achieving speedup by means of parallel processing. Although the research goals aim at improving the performance of natural language interfaces in general, the research in this thesis focuses on parallel parsing. The reason for this was that the parsing component of the Deltra system, which initially was the target platform of our research, was by far the most computationally expensive component. The parsing component is often the most computationally expensive component for other natural language processing applications as well. To broaden the scope of our research, we also investigated a parser for a different grammar (LinGO) at a later stage of the project. Although a dissertation often appears to be an individual achievement, there are a number of people to whom I am indebted. First and foremost, I would like to thank my promotors Henk Sips and Anton Nijholt and added promotor Ruud Sommerhalder for the guidance and support they have given me. I am especially grateful to Ruud Sommerhalder for his involvement with the successful completion of my dissertation. Also, the contents of this thesis would not have been what it is had I not had the right people around me. In this respect, I would like to thank several people. Firstly, I would like to thank Job Honig, for the many discussions often related to natural language parsing, Stephan Oepen, for providing me with the opportunity to get on track with the LinGO grammar, and Ulrich Callmeier for the help and support with the porting effort to make my parser compatible with the LinGO grammar. Secondly, I would like to thank all the people that enabled me to run my experiments on the right machinery: Jan Hol, for allowing me to use the 8 processor UltraSparc of the Faculty of Aerospace Engineering, and Takashi Ninomiya and Makino Takaki of the Department of Information Science at the University of Tokyo, for running experiments on their 64 processor UltraSparc. In computer science research, often …
منابع مشابه
A Parallel Parsing Algorithm for Natural Language using Tree Adjoining Grammar
D e e Adjoining G r a m m a r (TAG) is a powerful grammatical formalism for large-scale natural language processing. However, the computational complexity of parsing algorithms for TAG is high. W e introduce a new parallel TAG parsing algorithm for MIMD hypercube multicomputers, using large-granularity grammar partitioning, asynchronous communication , and distributed termination detection. W e...
متن کاملSpeeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method
In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...
متن کاملParallel Active Chart Parsing
Introduction In the field of linguistics, Active Chart Parsing (ACP) is an algorithm that generates all possible parsings of a sentence, given an ambiguous grammar. Therefore, ACP would be one part of a natural language interface to a database server, if real-time processing could be achieved. Parallel processing is one way to achieve real-time performance. A previously reported parallelization...
متن کاملEfficient Parallelization of Natural Language Applications using GPUs
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission....
متن کاملThe Performance of a Highly Unstructured Parallel Algorithmon the KSR 1 Tom
This paper examines the performance on the Kendall Square Research KSR1 multicomputer of a highly unstructured algorithm for natural language parsing. It describes a Tree Adjoining Grammar parsing algorithm that exhibits near linear speedup and very high eeciency for grammars of even moderate size. The work reported demonstrates the utility of shared-address-space parallel architectures for alg...
متن کامل